Approximate Multiple Protein Structure Alignment Using the Sum-of-Pairs Distance
نویسندگان
چکیده
منابع مشابه
Approximate Multiple Protein Structure Alignment Using the Sum-of-Pairs Distance
An algorithm is presented to compute a multiple structure alignment for a set of proteins and to generate a consensus (pseudo) protein for the set. The algorithm is a heuristic in that it computes an approximation to the optimal multiple structure alignment that minimizes the sum of the pairwise distances between the protein structures. The algorithm chooses an input protein as the initial cons...
متن کاملOptimal Sum-of-Pairs Multiple Sequence Alignment Using Incremental Carrillo and Lipman Bounds
Alignment of sequences is an important routine in various areas of science, notably molecular biology. Multiple sequence alignment is a computationally hard optimization problem which involves the consideration of different possible alignments in order to find an optimal one, given a measure of goodness of alignments. Dynamic programming algorithms are generally well suited for the search of op...
متن کاملOn Protein Structure Alignment under Distance Constraint
In this paper we study the protein structure comparison problem where each protein is modeled as a sequence of 3D points, and a contact edge is placed between every two of these points that are sufficiently close. Given two proteins represented this way, our problem is to find a subset of points from each protein, and a bijective matching of points between these two subsets, with the objective ...
متن کاملImproving the Divide-and-Conquer Approach to Sum-of-Pairs Multiple Sequence Alignment
We consider the problem of multiple sequence alignment: given k sequences of length at most n and a certain scoring function, find an alignment that minimizes the corresponding “sum of pairs” distance score. We generalize the divide-and-conquer technique described in [1,2], and present new ideas on how to use efficient search strategies for saving computer memory and accelerating the procedure ...
متن کاملProtein Structure-Structure Alignment with Discrete Fr'echet Distance
Matching two geometric objects in two-dimensional (2D) and three-dimensional (3D) spaces is a central problem in computer vision, pattern recognition, and protein structure prediction. In particular, the problem of aligning two polygonal chains under translation and rotation to minimize their distance has been studied using various distance measures. It is well known that the Hausdorff distance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Biology
سال: 2004
ISSN: 1066-5277,1066-5277
DOI: 10.1089/1066527042432198